• Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases 

      Semaev, Igor A.; Tenti, Andrea (Journal article; Peer reviewed, 2021)
      Gröbner basis methods are used to solve systems of polynomial equations over finite fields, but their complexity is poorly understood. In this work an upper bound on the time complexity of constructing a Gröbner basis ...
    • Statistical and Algebraic Properties of DES 

      Fauskanger, Stian; Semaev, Igor A. (Lecture Notes in Computer Science ; 9589, Chapter, 2016)
      D. Davies and S. Murphy found that there are at most 660 different probability distributions on the output from any three adjacent S-boxes after 16 rounds of DES. In this paper it is shown that there are only 72 different ...